Making Path Consistency Stronger for SAT *

Mapping CSP into Many-Valued SAT

We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and prove that it is refutation complete for many-valued CNF formulas and, moreover, enforces CSP (i, j)-consistency when applied to a many-valued SAT encoding of a CSP. Instances of our rule enforce well-known local consiste...

Permutation Problems and Channelling Constraints

We perform an extensive study of several different models of permutation problems proposed by Smith in [Smith, 2000]. We first define a measure of constraint tightness parameterized by the level of local consistency being enforced. We then compare the constraint tightness in these different models with respect to a large number of local consistency properties including arc-consistency, (restric...

Priority Setting on the Path to UHC: Time for Stronger Institutions and Stronger Health Systems: Response to Recent Commentaries

Inference Rules for High-Order Consistency in Weighted CSP

Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this paper we first define a new resolution rule, called signed Max-SAT parallel resolution, and prove that it is sound and complete for signed Max-SAT. Second, we define a restriction and a generalization of the previous r...

Solving weighted CSP by maintaining arc consistency

Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed [1]. In this paper we specialize this definition to weighted CSP and introduce two O(ed3) enforcing algorithms. Then, we refine the definition and introduce a stronger form of arc consistency (AC*) along with two O(n2d2 + ed3) algorithms. As in the CSP case, an important application of AC is ...